Best N - term capacitance approximation on sparse grids
نویسندگان
چکیده
In [GOS99], adaptive sparse grid spaces spanned by a finite number of tensor-product L2-orthogonal Haar functions have been applied to capacitance calculations on a unit screen. In this note, we state asymptotically optimal approximation rates for this problem when choosing the best possible adaptive sparse grid space of a given dimension N . We also compare the results with other recent approaches to efficiently solve this problem and comment on some numerical tests. Details of the proofs and a discussion of the approximation-theoretical aspects have appeared in [Osw99]. For a flat square screen I ≡ [0, 1], we consider the single layer potential equation
منابع مشابه
Parallelisation of Sparse Grids for Large Scale Data Analysis
Sparse Grids (SG), due to Zenger, are the basis for efficient high dimensional approximation and have recently been applied successfully to predictive modelling. They are spanned by a collection of simpler function spaces represented by regular grids. The combination technique prescribes how approximations on simple grids can be combined to approximate the high dimensional functions. It can be ...
متن کاملSOME RESULTS ON t-BEST APPROXIMATION IN FUZZY n-NORMED SPACES
The aim of this paper is to give the set of all t -best approximations on fuzzy n-normed spaces and prove some theorems in the sense of Vaezpour and Karimi [13].
متن کاملClassification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods, which employ ansatz functions associated to data points, we use a grid in the usually high-dimensional feature space for the minimization process. To cope with the curse of dimensionality, we employ sparse grids [52]...
متن کاملApproximation on Partially Ordered Sets of Regular Grids
In this paper we analyse the approximation of functions on partially ordered sequences of regular grids. We start with the formulation of minimal requirements for useful grid transfer operators in such a partially ordered context, and we continue with the introduction of hierarchical decompositions and the identiication of piecewise constant and piecewise linear approximations as special instan...
متن کاملAdaptive Sparse Grids for Hyperbolic Conservation Laws
We report on numerical experiments using adaptive sparse grid dis-cretization techniques for the numerical solution of scalar hyperbolic conservation laws. Sparse grids are an eecient approximation method for functions. Compared to regular, uniform grids of a mesh parameter h contain h ?d points in d dimensions, sparse grids require only h ?1 jloghj d?1 points due to a truncated , tensor-produc...
متن کامل